Probabilistic Lower Bounds for the Discrepancy of Latin Hypercube Samples
نویسندگان
چکیده
We provide probabilistic lower bounds for the star discrepancy of Latin hypercube samples. These bounds are sharp in the sense that they match the recent probabilistic upper bounds for the star discrepancy of Latin hypercube samples proved in [M. Gnewuch, N. Hebbinghaus. Discrepancy bounds for a class of negatively dependent random points including Latin hypercube samples. Preprint 2016.]. Together, this result and our work implies that the discrepancy of Latin hypercube samples differs at most by constant factors from the discrepancy of uniformly sampled point sets.
منابع مشابه
Fast Generation of Space-filling Latin Hypercube Sample Designs
Latin Hypercube Sampling (LHS) and Jittered Sampling (JS) both achieve better convergence than standard Monte Carlo Sampling (MCS) by using stratification to obtain a more uniform selection of samples, although LHS and JS use different stratification strategies. The “Koksma-Hlawka-like inequality” bounds the error in a computed mean in terms of the sample design’s discrepancy, which is a common...
متن کاملCentered L2-discrepancy of random sampling and Latin hypercube design, and construction of uniform designs
In this paper properties and construction of designs under a centered version of the L2-discrepancy are analyzed. The theoretic expectation and variance of this discrepancy are derived for random designs and Latin hypercube designs. The expectation and variance of Latin hypercube designs are significantly lower than that of random designs. While in dimension one the unique uniform design is als...
متن کاملLatinized, Improved Lhs, and Cvt Point Sets in Hypercubes
Abstract. It is shown how an arbitrary set of points in the hypercube can be Latinized, i.e., can be transformed into a point set that has the Latin hypercube property. The effect of Latinization on the star discrepancy and other uniformity measures of a point set is analyzed. For a few selected but representative point sampling methods, evidence is provided to show that Latinization lowers the...
متن کاملLatin Hypercube Sampling with Evolutionary Algorithm for Static Security Risk Assessment
Due to correlation coefficient matrix of initialized samples are not always positive definite, this paper presents the improved Latin Hypercube Sampling (LHS) methods with Evolutionary Algorithm (EA) to control correlation and handle power system probability analysis problem. To deal with the non-positive definite correlation matrix, an improved median Latin hypercube sampling with evolutionary...
متن کاملCommodity price uncertainty propagation in open-pit mine production planning by Latin hypercube sampling method
Production planning of an open-pit mine is a procedure during which the rock blocks are assigned to different production periods in a way that leads to the highest net present value (NPV) subject to some operational and technical constraints. This process becomes much more complicated by incorporation of the uncertainty existing in the input parameters. The commodity price uncertainty is among ...
متن کامل